home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
EnigmA Amiga Run 1996 March
/
EnigmA AMIGA RUN 05 (1996)(G.R. Edizioni)(IT)[!][issue 1996-03][Skylink CD IV].iso
/
earcd
/
util1
/
sesam1_3.lha
/
SeekSame.doc
< prev
Wrap
Text File
|
1995-11-07
|
5KB
|
153 lines
SeekSame/SeekSame SeekSame/SeekSame
NAME
SeekSame (Sesam) - seeks for same files and replaces superfluous
copies by hardlinks
VERSION
$VER: SeekSame.doc v1.3 (7.11.95)
COPYRIGHT
© 1994/95 Stephan Fuhrmann
This program is SHAREWARE. If you use it, send 10 DM to the
author.
Ideas, concepts and algorithms used in this program and the
included documentation may not be duplicated, changed, replaced
or reused.
WARNING
SeekSame is a program that modifies data on your harddrives.
It's possible that it doesn't do the things it should do, in
some cases it could do more than it should. If you use it and
it does something unexpected and you loose, destroy or manipulate
data, software, hardware, health or something else that is or is
not valuable, don't ask me to compensate your loss. You've
been warned.
SYNOPSIS
SeekSame DIR/A,ALL/S,DEL/S,MAKELINK/S,QUIET/S,VERBOSE/S
FUNCTION
The purpose of this program is seeking equal files on
the harddisk and forcing the OS to reduce the redundant
files to a minimum. The result of this method is a gain
in free hard disk storage while the data are not being
compressed; the method is absolutely compatible and
requires no additional software out of OS 2.0.
This command searches in the given directory for
files with equal contents and performs actions that
are adjusted to the filetype. In the easiest case this
is nothing - that's useful for checking the harddrive
for same files because SeekSame prints statistics containing
the possible freeable bytecount after each run. The next
variation is deleting all equal files but one - this is
useful for filecompilations like pictures. The most interesting
possibility is offered in combination with the Hardlinks of
the filesystem - with their help it's possible to delete
all same files but one and to create references at the place
of the deleted files to the file that's left. With this
method it's transparent for all programs and the OS whether
the files are the originals or their clones.
The handling of hardlinks is given for the files: when
a hardlink or the file is deleted, all files are still
preserved until the last reference to the file as been
removed.
There are 4 different passes:
'Processing files' - every file on the harddisk is being
examined and global datas being remembered.
This is the most timeconsuming pass because
there usually must be read all contents of the
harddisk.
'Generating table' - the remembered global datas are being
transcribed to a table.
'Searching multiple occurances' - it's being searched for
same files and the userdefined actions
are being performed.
'Cleanup' - the memory for the global datas is being freed by
the OS.
SeekSame is very successful on harddisks with many icons or
other files of the same kind. On my 120 MByte harddisk SeekSame
could free 5 MByte superfluous data.
PARAMETERS
DIR/A - the directory with optional search pattern to search in.
If you want to keep backup files, use '~(#?.bak)'. The
directory parameter _must_ be given.
ALL/S - if this keyword is given all subdirectories are
processed as well.
DEL/S - if this keyword is given, all redundant files are
deleted but one.
MAKELINK/S - with this keyword SeekSame deletes all redundant
files and creates hardlinks instead. This option
is propably the most interesting one.
QUIET/S - with this keyword you tell SeekSame, that you don't
waht to be nerved with superfluous information.
VERBOSE/S - this keyword forces SeekSame to print very
superfluous information like the filesize of each file.
RESULT
The statistics contain the total number of processed files,
the total number of processed bytes, the number of deleted
files and the sum of freed bytes followed by the value of
the possible freeable bytes.
The best thing: some MByte free harddisk storage without
direct disadvantages.
NOTICES
For a big number of files SeekSame needs more memory. Out of that,
the freeing of the resources takes longer (Cleanup).
When you're working with a big depth of subdirectories you
should use a big stack (>=20 kB).
The algorithm works with a method that's been invented by me
and is very fast. Though, you should have a big cup of coffee
when you're processing a big harddisk.
BUGS
None known.
AUTHOR
Stephan Fuhrmann
Ostmarkstraße 19
76227 Karlsruhe
GERMANY
e-mail: Stephan.Fuhrmann@stud.uni-karlsruhe.de